constraint composite graph造句

The " hybrid " computational properties of the constraint composite graph are reflected in the following two important results:
Unlike the constraint network, the constraint composite graph provides a unifying framework for representing both the graphical structure of the variable-interactions as well as the numerical structure of the weighted constraints.
(Result 2 ) Many subclasses of weighted constraint satisfaction problems that are tractable by virtue of the numerical structure of their weighted constraints have associated constraint composite graphs that are bipartite in nature.
It can be constructed using a simple polynomial-time procedure; and a given weighted constraint satisfaction problem is reducible to the problem of computing the minimum weighted vertex cover for its associated constraint composite graph.
Result 2 shows that the constraint composite graph can also be used to capture the numerical structure of the weighted constraints ( since a minimum weighted vertex cover can be computed in polynomial time for bipartite graphs ).
It's difficult to find constraint composite graph in a sentence. 用constraint composite graph造句挺难的

Result 1 shows that the constraint composite graph can be used to capture the graphical structure of the variable-interactions ( since a minimum weighted vertex cover for any graph can be computed in time exponential only in the treewidth of that graph ).